A λ-calculus with explicit weakening and explicit substitution
نویسندگان
چکیده
منابع مشابه
Strong Normalization of Herbelin's Explicit Substitution Calculus with Substitution Propagation
Herbelin presented (at CSL'94) a simple sequent calculus for minimal implicational logic, extensible to full rst-order intuitionistic logic, with a complete system of cut-reduction rules which is both con uent and strongly normalising. Some of the cut rules may be regarded as rules to construct explicit substitutions. He observed that the addition of a cut permutation rule, for propagation of s...
متن کاملAn output - based semantics of Λ μ with explicit substitution in the π - calculus Extended
We study the Λμ-calculus, extended with explicit substitution, and define a compositional output-based translation into a variant of the π-calculus with pairing. We show that this translation preserves single-step explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a no...
متن کاملAn output - based semantics of Λ μ with explicit substitution in the π - calculus
We study the Λμ-calculus, extended with explicit substitution, and define a compositional output-based translation into a variant of the π-calculus with pairing. We show that this translation preserves single-step explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a no...
متن کاملLambda Calculus with Explicit Recursion
This paper is concerned with the study of-calculus with explicit recursion, namely of cyclic-graphs. The starting point is to treat a-graph as a system of recursion equations involving-terms, and to manipulate such systems in an unrestricted manner, using equational logic, just as is possible for rst-order term rewriting. Surprisingly, now the connuence property breaks down in an essential way....
متن کاملEvent Calculus with Explicit Quantifiers
Kowalski and Sergot’s Event Calculus (EC ) is a simAppeared in the Proceedings of the Fifth International Workshop on Temporal Representation and Reasoning — TIME’98 (R. Morris, L. Khatib editors), pp. 81–88, IEEE Computer Society Press, Sanibel Island, FL, 16–17 May 1998. ple temporal formalism that, given a set of event occurrences, derives the maximal validity intervals (MVIs) over which pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Structures in Computer Science
سال: 2001
ISSN: 0960-1295,1469-8072
DOI: 10.1017/s0960129500003224